An Optimal Distributed Routing Algorithm using Dual Decomposition Techniques
نویسندگان
چکیده
منابع مشابه
An Optimal Distributed Routing Algorithm Using Dual Decomposition Techniques
We consider the routing problem in wireline, packet-switched communication networks. We cast our optimal routing problem in a multicommodity network flow optimization framework. Our cost function is related to the congestion in the network, and is a function of the flows on the links of the network. The optimization is over the set of flows in the links corresponding to the various destinations...
متن کاملSimulation of a Routing Algorithm Using Distributed Simulation Techniques
This paper describes our experiment in simulation of a routing algorithm in ATM networks using distributed simulation techniques. These techniques are a promising tool for performance evaluation of large and complex systems that can not be handled sequentially. The simulations are performed on a CM-5 and the results show that interesting speedups can be achieved when compared to a sequential ex...
متن کاملOptimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملDual Reinforcement Q - Routing : an on - Lineadaptive Routing Algorithm
This paper describes and evaluates the Dual Reinforcement Q-Routing algorithm (DRQ-Routing) for adaptive packet routing in communication networks. Each node in the network has a routing decision maker that adapts, on-line, to learn routing policies that can sustain high network loads and have low average packet delivery time. These decision makers learn based on the information they get back fr...
متن کاملA Distributed Algorithm for Throughput Optimal Routing in Overlay Networks
We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capable of implementing any dynamic routing policy, however, the legacy underlay has a fixed, single path routing scheme and uses a simple work-conserving forwarding policy. Moreover, the underlay routes are pre-determined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Information and Systems
سال: 2008
ISSN: 1526-7555,2163-4548
DOI: 10.4310/cis.2008.v8.n3.a5